Consistent Neighbourhood in a Tabu Search
نویسندگان
چکیده
We present a general approach for solving Constraint Optimization Problems. A Tabu Search is performed on a well-designed Consistent Neighbourhood built using Constraint Programming. After each variable assignment, the conflicting variables are deleted to maintain the consistency of the instantiated constraints. Hence, instead of allowing infeasible moves on complete configurations, it works on partial and consistent ones until a solution is found. This approach is successfully applied in solving real-life problems. Two ones are presented: the Frequency Assignment Problem with Polarization and the Agile Earth Observing Satellite Management Problem.
منابع مشابه
A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملTabu Search with Consistent Neighbourhood for Strip Packing
This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem knowledge, and a diversification based on the history of the search. The neighborhood only considers valid, sometimes partial, packings. The fitness function incorporates measures related to the empty spaces. Diversifi...
متن کاملRestricted Neighbourhood Search: An Implicit Tabu Method
Recent work 1] has highlighted the value of using a restricted candidate list in the implementation of the Tabu Search (TS) method. The original motivation for this approach was to reduce the amount of computation involved in applying TS to the solution of owshop sequencing problems. However, it is becoming evident that this concept of restricted neighbourhood search (RNS) can itself act as a d...
متن کاملAn incremental tabu search heuristic for the generalized vehicle routing problem with time windows
This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can successfully be applied to a large variety of specific problems. The algorithm builds upon a previously developed tabu search heuristic by replacing its neighbourhood structure. The new neighbourhood i...
متن کاملTabu Search Heuristics for the Vehicle Routing Problem
This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005